# Author:Zhang Yu
import heapq


if __name__ == '__main__':
    step = [1, 3, 0, 2, 4, 4, 2, 0, 1]
    max_num = heapq.nlargest(1,step)
    print(max_num)